翻訳と辞書 |
Yoshiharu Kohayakawa : ウィキペディア英語版 | Yoshiharu Kohayakawa Yoshiharu Kohayakawa (Japanese name: ''コハヤカワヨシハル'', born 1963) is a Japanese-Brazilian mathematician working on discrete mathematics and probability theory.〔(Brazilian Academy of Sciences – Yoshiharu Kohayakawa )〕 He is known for his work on Szemerédi's regularity lemma, which he extended to sparser graphs.〔László Lovász – ''Large Networks and Graph Limits'', p. 395〕〔Bridget S. Webb – ''Surveys in Combinatorics 2005'', p. 227〕 He was a student of Béla Bollobás on the University of Cambridge.〔(Mathematics Genealogy Project – Yoshiharu Kohayakawa )〕 According to Google Scholar, as of 24 May 2015, Kohayakawa's works have been cited over 2100 times, and his h-index is 27.〔(Google Scholar Profile – Yoshiharu Kohayakawa )〕 He is a titular member of the Brazilian Academy of Sciences.〔 In 2000, five American researchers received an USA NSF Research Grant in the value of $20,000 to go to Brazil to work in collaboration with him on mathematical problems.〔(U.S.-Brazil Cooperative Research: Problems on Random Graphs (Structures) and Set Systems: NSG GRANT 0072064 )〕 ==References==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Yoshiharu Kohayakawa」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|